Another Combinatorial Determinant

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

O ct 1 99 8 Another combinatorial determinant

= 1!2! · · ·n!b n(n+1)/2 1 (n = 0, 1, 2, . . . ). In fact, we prove both of these theorems at once, by formulating and proving a common generalization. In both theorems, each row of the matrix is obtained from the previous row by applying a certain transformation of power series: in Theorem 1, the transformation is t 7→ t(1 + a1x + a2x 2 + · · · ), while in Theorem 2, the transformation is t 7→...

متن کامل

1 8 M ay 1 99 9 Another combinatorial determinant

= 1!2! · · ·n!b n(n+1)/2 1 (n = 0, 1, 2, . . . ). In fact, we prove both of these theorems at once, by formulating and proving a common generalization. In both theorems, each row of the matrix is obtained from the previous row by applying a certain transformation of power series: in Theorem 1, the transformation is t 7→ t(1 + a1x + a2x 2 + · · · ), while in Theorem 2, the transformation is t 7→...

متن کامل

8 M ay 1 99 9 Another combinatorial determinant

= 1!2! · · ·n!b n(n+1)/2 1 (n = 0, 1, 2, . . . ). In fact, we prove both of these theorems at once, by formulating and proving a common generalization. In both theorems, each row of the matrix is obtained from the previous row by applying a certain transformation of power series: in Theorem 1, the transformation is t 7→ t(1 + a1x + a2x 2 + · · · ), while in Theorem 2, the transformation is t 7→...

متن کامل

A combinatorial determinant

A theorem of Mina evaluates the determinant of a matrix with entries D(f(x)). We note the important special case where the matrix entries are evaluated at x = 0 and give a simple proof of it, as well as some special additivity properties that hold in this case, but not in general. Some applications are given also. We then give a short proof of the general case. October 25, 1998 An old theorem o...

متن کامل

A Combinatorial Determinant Dual to the Group Determinant

We define the commuting algebra determinant of a finite group action on a finite set, a notion dual to the group determinant of Dedekind. We show that the following combinatorial example is a commuting algebra determinant. Let Bq(n) denote the set of all subspaces of an n-dimensional vector space over Fq. The type of an ordered pair (U, V ) of subspaces, where U, V ∈ Bq(n), is the ordered tripl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2000

ISSN: 0097-3165

DOI: 10.1006/jcta.1999.3029